DMMU: Dynamic Memory Management Unit

نویسندگان

  • J. Morris Chang
  • Witawas Srisa-an
  • Chia-Tien Dan Lo
چکیده

Dynamic memory management has been a performance bottleneck in many operating systems including multithreaded and real-time operating systems. Moreover, recent advances in software engineering, such as graphical user interface and object-oriented programming, have caused applications to become more memory intensive. The growing popularity of these operating systems and applications increases the importance of high-performance dynamic memory management. Currently, the heap management is done through software routines (e.g. malloc and free in C/C++) and handled in a per process base. This paper presents a hardware implementation of DMMU which will be shared by all the processes in the same way that the TLBs (Translation Look-aside Buffers) used in current MMU. This DMMU employs a novel approach to implement an efficient memory management. Allocation and deallocation are performed in hardware domain. The detailed design and evaluation of the proposed DMMU are presented in this paper. Simulation results show that the hit ratio for 1 Kbits and 8 Kbits buffer are ranging from 78-99% and 95-99%, respectively. At the same time, the memory overhead for 1 Kbits is 10% and for the 8 Kbits is 0%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Per-flow Queuing Memory Management without Per-flow Queues in High Speed Routers

Packet buffering in high speed routers requires a memory management unit to maintain the structure of the queues. With the dramatic increase in link speed and number of traffic flows, per-flow queuing becomes more and more challenging for the memory management unit since millions of queues should be maintained. To address this issue, a scheme called Dynamic Queue Sharing (DQS) is proposed in th...

متن کامل

Feasibility of decoupling memory management from the execution pipeline

In conventional architectures, the central processing unit (CPU) spends a significant amount of execution time allocating and de-allocating memory. Efforts to improve memory management functions using custom allocators have led to only small improvements in performance. In this work, we test the feasibility of decoupling memory management functions from the main processing element to a separate...

متن کامل

The Measured Cost of Conservative Garbage Collection University of Colorado at Boulder the Measured Cost of Conservative Garbage Collection

Because dynamic memory management is an important part of a large class of computer programs, high-performance algorithms for dynamic memory management have been, and will continue to be, of considerable interest. Experience indicates that for many programs, dynamic storage allocation is so important that programmers feel compelled to write and use their own domain-speciic allocators to avoid t...

متن کامل

The Measured Cost of Conservative Garbage Collection

Because dynamic memory management is an important part of a large class of computer programs, high-performance algorithms for dynamic memory management have been, and will continue to be, of considerable interest. Experience indicates that for many programs, dynamic storage allocation is so important that programmers feel compelled to write and use their own domainspecific allocators to avoid t...

متن کامل

Register Efficient Dynamic Memory Allocator for GPUs

We compare five existing dynamic memory allocators optimized for GPUs and show their strengths and weaknesses. In the measurements we use three generic evaluation tests proposed in the past and we add one with a real workload, where dynamic memory allocation is used in building the k-d tree data structure. Following the performance analysis we propose a new dynamic memory allocator and its vari...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999